ti.\*:("Approximation, randomization, and combinatorial optimization (algorithms and techniques)")
Results 1 to 25 of 117
Selection :
Approximation, randomization, and combinatorial optimization (algorithms and techniques)Arora, Sanjeev; Jansen, Klaus; Rolim, José D.P et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40770-7, IX, 408 p, isbn 3-540-40770-7Conference Proceedings
Approximation, randomization, and combinatorial optimization (algorithms and techniques)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38044-2, 1Vol, XII-522 p, isbn 3-540-38044-2Conference Proceedings
Testing the independence number of hypergraphsLANGBERG, Michael.Lecture notes in computer science. 2004, pp 405-416, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper
Perfectly balanced allocationCZUMAJ, Artur; RILEY, Chris; SCHEIDELER, Christian et al.Lecture notes in computer science. 2003, pp 240-251, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper
Simultaneous Source LocationANDREEV, Konstantin; GARROD, Charles; MAGGS, Bruce et al.Lecture notes in computer science. 2004, pp 13-26, issn 0302-9743, isbn 3-540-22894-2, 14 p.Conference Paper
Min-max multiway cutSVITKINA, Zoya; TARDOS, Eva.Lecture notes in computer science. 2004, pp 207-218, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper
Edge coloring with delaysALON, Noga; ASODI, Vera.Lecture notes in computer science. 2004, pp 237-248, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper
Approximate testing of visual propertiesRASKHODNIKOVA, Sofya.Lecture notes in computer science. 2003, pp 370-381, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper
Approximating market equilibriaJAIN, Kamal; MAHDIAN, Mohammad; SABERI, Amin et al.Lecture notes in computer science. 2003, pp 98-108, issn 0302-9743, isbn 3-540-40770-7, 11 p.Conference Paper
On the hardness of approximate multivariate integrationKOUTIS, Ioannis.Lecture notes in computer science. 2003, pp 122-128, issn 0302-9743, isbn 3-540-40770-7, 7 p.Conference Paper
On the crossing spanning tree problemBILO, Vittorio; GOYAL, Vineet; RAVI, R et al.Lecture notes in computer science. 2004, pp 51-60, issn 0302-9743, isbn 3-540-22894-2, 10 p.Conference Paper
On bounded distance decoding for general latticesLIU, Yi-Kai; LYUBASHEVSKY, Vadim; MICCIANCIO, Daniele et al.Lecture notes in computer science. 2006, pp 450-461, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper
Randomness-efficient sampling within NCHEALY, Alexander.Lecture notes in computer science. 2006, pp 398-409, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper
Single-source stochastic routingCHAWLA, Shuchi; ROUGHGARDEN, Tim.Lecture notes in computer science. 2006, pp 82-94, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 13 p.Conference Paper
On the error parameter of dispersersGRADWOHL, Ronen; KINDLER, Guy; REINGOLD, Omer et al.Lecture notes in computer science. 2005, pp 294-305, issn 0302-9743, isbn 3-540-28239-4, 12 p.Conference Paper
Approximating the bandwidth of caterpillarsFEIGE, Uriel; TALWAR, Kunal.Lecture notes in computer science. 2005, pp 62-73, issn 0302-9743, isbn 3-540-28239-4, 12 p.Conference Paper
Approximating the distortionHALL, Alexander; PAPADIMITRIOU, Christos.Lecture notes in computer science. 2005, pp 111-122, issn 0302-9743, isbn 3-540-28239-4, 12 p.Conference Paper
Estimating the distance to a monotone functionAILON, Nir; CHAZELLE, Bernard; COMANDUR, Seshadhri et al.Lecture notes in computer science. 2004, pp 229-236, issn 0302-9743, isbn 3-540-22894-2, 8 p.Conference Paper
Approximation schemes for broadcasting in heterogenous networksKHULLER, Samir; KIM, Yoo-Ah; WOEGINGER, Gerhard et al.Lecture notes in computer science. 2004, pp 163-170, issn 0302-9743, isbn 3-540-22894-2, 8 p.Conference Paper
Approximation algorithms for channel allocation problems in broadcast networksGANDHI, Rajiv; KHULLER, Samir; SRINIVASAN, Aravind et al.Lecture notes in computer science. 2003, pp 47-58, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper
Order in pseudorandomnessVADHAN, Salil P.Lecture notes in computer science. 2001, pp 10-11, issn 0302-9743, isbn 3-540-42470-9Conference Paper
Consistency of local density matrices is QMA-completeLIU, Yi-Kai.Lecture notes in computer science. 2006, pp 438-449, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper
Dobrushin conditions and systematic scanDYER, Martin; GOLDBERG, Leslie Ann; JERRUM, Mark et al.Lecture notes in computer science. 2006, pp 327-338, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper
Fractional matching via balls-and-binsMOTWANI, Rajeev; PANIGRAHY, Rina; YING XU et al.Lecture notes in computer science. 2006, pp 487-498, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper
Space complexity vs. query complexityLACHISH, Oded; NEWMAN, Ilan; SHAPIRA, Asaf et al.Lecture notes in computer science. 2006, pp 426-437, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper